Iterated nearest neighbors and finding minimal polytopes
نویسندگان
چکیده
منابع مشابه
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest neighbors to each point. We argue that this is better in a number of ways than previous algorithms, which were based on high order Voronoi diagrams. Our technique allows us for the rst time to e ciently maintain minima...
متن کاملFinding Data Broadness Via Generalized Nearest Neighbors
A data object is broad if it is one of the k-Nearest Neighbors (k-NN) of many data objects. We introduce a new database primitive called Generalized Nearest Neighbor (GNN) to express data broadness. We also develop three strategies to answer GNN queries efficiently for large datasets of multidimensional objects. The R*-Tree based search algorithm generates candidate pages and ranks them based o...
متن کاملLocality-Sensitive Hashing for Finding Nearest Neighbors
1053-5888/08/$20.00©2008IEEE IEEE SIGNAL PROCESSING MAGAZINE [128] MARCH 2008 T he Internet has brought us a wealth of data, all now available at our fingertips. We can easily carry in our pockets thousands of songs, hundreds of thousands of images, and hundreds of hours of video. But even with the rapid growth of computer performance, we don’t have the processing power to search this amount of...
متن کاملComplexity of Finding Nearest Colorful Polytopes
Let P1, . . . , Pd+1 ⊂ R be point sets whose convex hulls each contain the origin. Each set represents a color class. The Colorful Carathéodory theorem guarantees the existence of a colorful choice, i.e., a set that contains exactly one point from each color class, whose convex hull also contains the origin. The computational complexity of finding such a colorful choice is still unknown. We stu...
متن کاملOn Finding Nearest Neighbors in a Set of Compressible Signals
Numerous applications demand that we manipulate large sets of very high-dimensional signals. A simple yet common example is the problem of finding those signals in a database that are closest to a query. In this paper, we tackle this problem by restricting our attention to a special class of signals that have a sparse approximation over a basis or a redundant dictionary. We take advantage of sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1994
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02574012